Table-Lookup Methods for Improved Performance-Driven Routing - Design Automation Conference, 1998. Proceedings

نویسنده

  • Premal Buch
چکیده

T h e inaccuracy of Elmore delay [3] f o r interconnect delay estimation i s well-documented. However it remains a popular delay measure t o drive performance optimization procedures such as wire-sizing and topology construction. This paper studies the meri ts of incorporating “better-than-Elmore” delay measures into the optimization process. T h e proposed delay metr ics use a table-lookup method to incorporate better load modeling and approximate the eflect of signal slew. We demonstrate that the proposed metr ics exhibit a m u c h narrower error distribution than Elmore delay, eliminating Elmore’s frequent gross delay over-estimation. Finally we show the improvement in solution quality which can be had by incorporating the new metrics in to a timing driven topology construction algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handling routability in floorplan design with twin binary trees

As technology moves into the deep-submicron era, the complexities of VLSI circuits grow rapidly. Interconnect optimization has become an important concern. Most routability-driven floorplanners [H.M. Chen, H. Zhou, F.Y. Young, D.F. Wong, H.H. Yang, N. Sherwani, Integrated floorplanning and interconnect planning, in: Proceedings of IEEE International Conference on Computer-Aided Design, 1999, pp...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

An Ultra Low Power Variable Length Decoder For Mpeg-2 Exploiting Codeword Distribution - Custom Integrated Circuits Conference, 1998. Proceedings of the IEEE 1998

tector and the lookup table. The VLC detector receives the input variable length codes and generates an address for the lookup table (LUT). To reduce additional circuit overhead, address generation is implemented by aligning the VLCs at a fixed position so that the lookup table uses the VLC itself as the address. The lookup table receives the address from the VLC detector and produces the corre...

متن کامل

IC Design of IPv6 Routing Lookup for High Speed Networks

In recent years, there are many researches for routing lookup. Most of them can achieve high average search throughput for IPv4, but they are slow in the updating speed and cannot suit to 128 bits IPv6 address even in hardware architecture. This paper proposed a routing lookup system which contains an ASIC of routing lookup table and offchip memory sets. In the performance analysis, 91.89% rout...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004